Computing the Tutte Polynomial of a Matroid from its Lattice of Cyclic Flats
نویسنده
چکیده
We show how the Tutte polynomial of a matroid M can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of M is already determined by the abstract lattice of its cyclic flats together with their cardinalities and ranks. They furthermore generalize similiar statements for perfect matroid designs and near designs due to Brylawski (1980) and help to understand families of matroids with identical Tutte polynomials as constructed by Giménez and later improved by Shoda (2012).
منابع مشابه
An Introduction to Transversal Matroids
1. Prefatory Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Several Perspectives on Transversal Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1. Set systems, transversals, partial transversals, and Hall’s theorem . . . . . . . . 2 2.2. Transversal matroids via matrix encodings of set systems . . . . . ....
متن کاملComputing the Tutte polynomial of lattice path matroids using determinantal circuits
We give a quantum-inspired Opnq algorithm computing the Tutte polynomial of a lattice path matroid, where n is the size of the ground set of the matroid. Furthermore, this can be improved to Opnq arithmetic operations if we evaluate the Tutte polynomial on a given input, fixing the values of the variables. The best existing algorithm, found in 2004, was Opnq, and the problem has only been known...
متن کاملCharacterizing Combinatorial Geometries by Numerical Invariants
We show that the projective geometry PG(r − 1, q) for r > 3 is the only rank-r (combinatorial) geometry with (qr − 1)/(q − 1) points in which all lines have at least q + 1 points. For r = 3, these numerical invariants do not distinguish between projective planes of the same order, but they do distinguish projective planes from other rank-3 geometries. We give similar characterizations of affine...
متن کاملA Tutte polynomial inequality for lattice path matroids
Let M be a matroid without loops or coloops and let TM be its Tutte polynomial. In 1999 Merino and Welsh conjectured that max(TM (2, 0), TM (0, 2)) ≥ TM (1, 1) for graphic matroids. Ten years later, Conde and Merino proposed a multiplicative version of the conjecture which implies the original one. In this paper we show the validity of the multiplicative conjecture when M is a lattice path matr...
متن کاملLattice path matroids: enumerative aspects and Tutte polynomials
Fix two lattice paths P and Q from ð0; 0Þ to ðm; rÞ that use East and North steps with P never going above Q: We show that the lattice paths that go from ð0; 0Þ to ðm; rÞ and that remain in the region bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call a lattice path matroid. We consider a variety of enumerative aspects of these matroid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014